Stochastic tensors and approximate symmetry
نویسندگان
چکیده
منابع مشابه
Symmetry-Based Model Reduction for Approximate Stochastic Analysis
For models of cell-to-cell communication, with many reactions and species per cell, the computational cost of stochastic simulation soon becomes intractable. Deterministic methods, while computationally more efficient, may fail to contribute reliable approximations for those models. In this paper, we suggest a reduction for models of cell-to-cell communication, based on symmetries of the underl...
متن کاملOn Multi-Stochastic Tensors and its Applications
In this talk, we presented the Birkhoff-von Neumann type theorem for a multistochastic tensors. In particular, we give a necessary and sufficient condition such that a multi-stochastic tensor is a convex combination of finitely many permutation tensors. It is well-known that extreme points in the set of doubly-stochastic matrices are just permutation matrices. However, we find that extreme poin...
متن کاملExploiting Symmetry in Tensors for High Performance
Symmetric tensor operations arise in a wide variety of computations. However, the benefits of exploiting symmetry in order to reduce storage and computation is in conflict with a desire to simplify memory access patterns. In this paper, we propose Blocked Compact Symmetric Storage wherein we consider the tensor by blocks and store only the unique blocks of a symmetric tensor. We propose an algo...
متن کاملSymmetry Classes for Even-order Tensors
The purpose of this article is to give a complete and general answer to the recurrent problem in continuum mechanics of the determination of the number and the type of symmetry classes of an even-order tensor space. This kind of investigation was initiated for the space of elasticity tensors. Since then, different authors solved this problem for other kinds of physics such as photoelectricity, ...
متن کاملAbstraction via Approximate Symmetry
ion via Approximate Symmetry Thomas Ellman Department of Computer Science Rutgers University New Brunswick, NJ 08903 [email protected] LCSR-TR-199 Abstract Abstraction techniques are important for solving constraint satisfaction problems with global constraints and low solution density. In the presence of global constraints, backtracking search is unable to prune partial solutions. It there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.02.013